./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1d5fa637 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 969ea7ac1a6cea553b276c54292ec8e81265daf8dd23428f445a60f39343440e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 09:05:46,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 09:05:46,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 09:05:46,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 09:05:46,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 09:05:46,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 09:05:46,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 09:05:46,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 09:05:46,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 09:05:46,918 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 09:05:46,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 09:05:46,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 09:05:46,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 09:05:46,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 09:05:46,922 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 09:05:46,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 09:05:46,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 09:05:46,923 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 09:05:46,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 09:05:46,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 09:05:46,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 09:05:46,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 09:05:46,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 09:05:46,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 09:05:46,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 09:05:46,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 09:05:46,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 09:05:46,928 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 09:05:46,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 09:05:46,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 09:05:46,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 09:05:46,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 09:05:46,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 09:05:46,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 09:05:46,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 09:05:46,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 09:05:46,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 09:05:46,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 09:05:46,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 09:05:46,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 09:05:46,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 09:05:46,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 09:05:46,933 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 969ea7ac1a6cea553b276c54292ec8e81265daf8dd23428f445a60f39343440e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 09:05:47,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 09:05:47,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 09:05:47,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 09:05:47,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 09:05:47,231 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 09:05:47,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c [2024-09-13 09:05:48,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 09:05:48,912 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 09:05:48,913 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c [2024-09-13 09:05:48,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/11ab391ff/ad648621911244bfb650339c37a64f71/FLAG6b10dd590 [2024-09-13 09:05:49,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/11ab391ff/ad648621911244bfb650339c37a64f71 [2024-09-13 09:05:49,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 09:05:49,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 09:05:49,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 09:05:49,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 09:05:49,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 09:05:49,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 09:05:49" (1/1) ... [2024-09-13 09:05:49,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5008a10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49, skipping insertion in model container [2024-09-13 09:05:49,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 09:05:49" (1/1) ... [2024-09-13 09:05:49,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 09:05:49,474 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c[576,589] [2024-09-13 09:05:49,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 09:05:49,497 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 09:05:49,506 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound2.c[576,589] [2024-09-13 09:05:49,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 09:05:49,533 INFO L204 MainTranslator]: Completed translation [2024-09-13 09:05:49,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49 WrapperNode [2024-09-13 09:05:49,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 09:05:49,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 09:05:49,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 09:05:49,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 09:05:49,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49" (1/1) ... [2024-09-13 09:05:49,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49" (1/1) ... [2024-09-13 09:05:49,561 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 09:05:49,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 09:05:49,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 09:05:49,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 09:05:49,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 09:05:49,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49" (1/1) ... [2024-09-13 09:05:49,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49" (1/1) ... [2024-09-13 09:05:49,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49" (1/1) ... [2024-09-13 09:05:49,604 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-13 09:05:49,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49" (1/1) ... [2024-09-13 09:05:49,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49" (1/1) ... [2024-09-13 09:05:49,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49" (1/1) ... [2024-09-13 09:05:49,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49" (1/1) ... [2024-09-13 09:05:49,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49" (1/1) ... [2024-09-13 09:05:49,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49" (1/1) ... [2024-09-13 09:05:49,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 09:05:49,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 09:05:49,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 09:05:49,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 09:05:49,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49" (1/1) ... [2024-09-13 09:05:49,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 09:05:49,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:05:49,666 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-13 09:05:49,671 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-13 09:05:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 09:05:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 09:05:49,713 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 09:05:49,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 09:05:49,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 09:05:49,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 09:05:49,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 09:05:49,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 09:05:49,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 09:05:49,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 09:05:49,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 09:05:49,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 09:05:49,783 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 09:05:49,785 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 09:05:49,957 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-13 09:05:49,958 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 09:05:49,987 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 09:05:49,987 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 09:05:49,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:05:49 BoogieIcfgContainer [2024-09-13 09:05:49,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 09:05:49,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 09:05:49,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 09:05:49,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 09:05:49,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 09:05:49" (1/3) ... [2024-09-13 09:05:49,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f89b81b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 09:05:49, skipping insertion in model container [2024-09-13 09:05:49,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 09:05:49" (2/3) ... [2024-09-13 09:05:49,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f89b81b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 09:05:49, skipping insertion in model container [2024-09-13 09:05:49,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:05:49" (3/3) ... [2024-09-13 09:05:50,000 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound2.c [2024-09-13 09:05:50,020 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 09:05:50,021 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 09:05:50,070 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 09:05:50,077 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@187b8dfb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 09:05:50,077 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 09:05:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 09:05:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 09:05:50,089 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:05:50,090 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:05:50,090 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:05:50,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:50,097 INFO L85 PathProgramCache]: Analyzing trace with hash -166019731, now seen corresponding path program 1 times [2024-09-13 09:05:50,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:05:50,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150182645] [2024-09-13 09:05:50,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:50,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:05:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:50,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:05:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:50,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:05:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 09:05:50,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:05:50,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150182645] [2024-09-13 09:05:50,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150182645] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:05:50,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:05:50,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 09:05:50,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436805904] [2024-09-13 09:05:50,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:05:50,373 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 09:05:50,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:05:50,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 09:05:50,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 09:05:50,408 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 09:05:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:05:50,547 INFO L93 Difference]: Finished difference Result 65 states and 98 transitions. [2024-09-13 09:05:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 09:05:50,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-13 09:05:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:05:50,558 INFO L225 Difference]: With dead ends: 65 [2024-09-13 09:05:50,559 INFO L226 Difference]: Without dead ends: 33 [2024-09-13 09:05:50,562 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-13 09:05:50,566 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:05:50,569 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 46 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:05:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-13 09:05:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-09-13 09:05:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 09:05:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-13 09:05:50,615 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 16 [2024-09-13 09:05:50,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:05:50,616 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-13 09:05:50,616 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 09:05:50,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-13 09:05:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 09:05:50,618 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:05:50,618 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:05:50,618 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 09:05:50,619 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:05:50,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:50,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1899526296, now seen corresponding path program 1 times [2024-09-13 09:05:50,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:05:50,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452535134] [2024-09-13 09:05:50,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:50,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:05:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:50,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:05:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:50,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:05:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 09:05:50,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:05:50,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452535134] [2024-09-13 09:05:50,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452535134] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:05:50,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:05:50,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 09:05:50,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971225292] [2024-09-13 09:05:50,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:05:50,842 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:05:50,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:05:50,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:05:50,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:05:50,844 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-13 09:05:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:05:50,983 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-09-13 09:05:50,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 09:05:50,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-09-13 09:05:50,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:05:50,985 INFO L225 Difference]: With dead ends: 41 [2024-09-13 09:05:50,986 INFO L226 Difference]: Without dead ends: 34 [2024-09-13 09:05:50,986 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 09:05:50,989 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:05:50,993 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:05:50,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-13 09:05:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-13 09:05:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 09:05:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-09-13 09:05:51,011 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 17 [2024-09-13 09:05:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:05:51,011 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-09-13 09:05:51,011 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-13 09:05:51,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-09-13 09:05:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 09:05:51,014 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:05:51,015 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:05:51,015 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 09:05:51,016 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:05:51,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1901015846, now seen corresponding path program 1 times [2024-09-13 09:05:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:05:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701559899] [2024-09-13 09:05:51,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:51,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:05:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:05:51,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [994267948] [2024-09-13 09:05:51,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:51,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:05:51,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:05:51,043 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-13 09:05:51,045 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-13 09:05:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:51,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 09:05:51,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:05:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 09:05:51,189 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 09:05:51,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:05:51,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701559899] [2024-09-13 09:05:51,190 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:05:51,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994267948] [2024-09-13 09:05:51,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994267948] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:05:51,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:05:51,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 09:05:51,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754655080] [2024-09-13 09:05:51,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:05:51,196 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:05:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:05:51,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:05:51,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:05:51,197 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 09:05:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:05:51,256 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-09-13 09:05:51,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 09:05:51,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-13 09:05:51,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:05:51,259 INFO L225 Difference]: With dead ends: 44 [2024-09-13 09:05:51,259 INFO L226 Difference]: Without dead ends: 42 [2024-09-13 09:05:51,259 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 09:05:51,260 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:05:51,261 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 135 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:05:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-13 09:05:51,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-09-13 09:05:51,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 09:05:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-09-13 09:05:51,276 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 17 [2024-09-13 09:05:51,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:05:51,277 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-09-13 09:05:51,278 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 09:05:51,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-09-13 09:05:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 09:05:51,279 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:05:51,279 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:05:51,296 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 09:05:51,484 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:05:51,485 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:05:51,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1706287866, now seen corresponding path program 1 times [2024-09-13 09:05:51,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:05:51,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065372874] [2024-09-13 09:05:51,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:51,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:05:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:05:51,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081058809] [2024-09-13 09:05:51,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:51,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:05:51,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:05:51,503 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-13 09:05:51,505 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-13 09:05:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:51,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 09:05:51,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:05:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 09:05:51,610 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 09:05:51,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:05:51,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065372874] [2024-09-13 09:05:51,610 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:05:51,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081058809] [2024-09-13 09:05:51,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081058809] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:05:51,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:05:51,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 09:05:51,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781796587] [2024-09-13 09:05:51,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:05:51,612 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:05:51,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:05:51,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:05:51,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:05:51,613 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 09:05:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:05:51,681 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-09-13 09:05:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 09:05:51,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-13 09:05:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:05:51,683 INFO L225 Difference]: With dead ends: 57 [2024-09-13 09:05:51,683 INFO L226 Difference]: Without dead ends: 54 [2024-09-13 09:05:51,683 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 09:05:51,684 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 09:05:51,685 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 124 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 09:05:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-13 09:05:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-09-13 09:05:51,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 32 states have internal predecessors, (38), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 09:05:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2024-09-13 09:05:51,697 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 22 [2024-09-13 09:05:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:05:51,697 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2024-09-13 09:05:51,697 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 09:05:51,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2024-09-13 09:05:51,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-13 09:05:51,698 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:05:51,698 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:05:51,713 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 09:05:51,902 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:05:51,903 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:05:51,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1856957465, now seen corresponding path program 1 times [2024-09-13 09:05:51,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:05:51,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134690767] [2024-09-13 09:05:51,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:51,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:05:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:05:51,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399104965] [2024-09-13 09:05:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:51,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:05:51,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:05:51,925 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-13 09:05:51,927 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-13 09:05:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:51,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-13 09:05:51,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:05:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 09:05:52,014 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 09:05:52,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:05:52,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134690767] [2024-09-13 09:05:52,015 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:05:52,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399104965] [2024-09-13 09:05:52,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399104965] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:05:52,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:05:52,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 09:05:52,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139023190] [2024-09-13 09:05:52,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:05:52,016 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 09:05:52,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:05:52,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 09:05:52,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 09:05:52,017 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 09:05:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:05:52,106 INFO L93 Difference]: Finished difference Result 82 states and 112 transitions. [2024-09-13 09:05:52,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 09:05:52,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2024-09-13 09:05:52,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:05:52,110 INFO L225 Difference]: With dead ends: 82 [2024-09-13 09:05:52,110 INFO L226 Difference]: Without dead ends: 80 [2024-09-13 09:05:52,110 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 09:05:52,111 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:05:52,111 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 141 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:05:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-13 09:05:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2024-09-13 09:05:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-13 09:05:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2024-09-13 09:05:52,143 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 30 [2024-09-13 09:05:52,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:05:52,144 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2024-09-13 09:05:52,144 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 09:05:52,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2024-09-13 09:05:52,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-13 09:05:52,145 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:05:52,145 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:05:52,163 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 09:05:52,345 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:05:52,346 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:05:52,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:52,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1900127414, now seen corresponding path program 1 times [2024-09-13 09:05:52,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:05:52,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928507063] [2024-09-13 09:05:52,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:52,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:05:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:52,514 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:05:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:52,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:05:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:52,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 09:05:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:52,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-13 09:05:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 09:05:52,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:05:52,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928507063] [2024-09-13 09:05:52,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928507063] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:05:52,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:05:52,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 09:05:52,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443958907] [2024-09-13 09:05:52,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:05:52,537 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 09:05:52,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:05:52,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 09:05:52,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-13 09:05:52,538 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-13 09:05:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:05:52,675 INFO L93 Difference]: Finished difference Result 112 states and 152 transitions. [2024-09-13 09:05:52,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-13 09:05:52,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2024-09-13 09:05:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:05:52,679 INFO L225 Difference]: With dead ends: 112 [2024-09-13 09:05:52,679 INFO L226 Difference]: Without dead ends: 77 [2024-09-13 09:05:52,680 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-13 09:05:52,681 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:05:52,681 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 74 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:05:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-13 09:05:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-09-13 09:05:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 48 states have internal predecessors, (57), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-13 09:05:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2024-09-13 09:05:52,699 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 33 [2024-09-13 09:05:52,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:05:52,699 INFO L474 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2024-09-13 09:05:52,700 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-13 09:05:52,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2024-09-13 09:05:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-13 09:05:52,701 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:05:52,702 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:05:52,702 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 09:05:52,702 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:05:52,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:52,703 INFO L85 PathProgramCache]: Analyzing trace with hash -2073680743, now seen corresponding path program 1 times [2024-09-13 09:05:52,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:05:52,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349721340] [2024-09-13 09:05:52,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:52,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:05:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:52,856 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:05:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:52,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:05:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:52,886 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 09:05:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:52,890 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-13 09:05:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:52,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-13 09:05:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:52,899 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 09:05:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-13 09:05:52,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:05:52,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349721340] [2024-09-13 09:05:52,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349721340] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:05:52,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 09:05:52,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-13 09:05:52,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998621563] [2024-09-13 09:05:52,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:05:52,905 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 09:05:52,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:05:52,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 09:05:52,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-13 09:05:52,907 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 09:05:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:05:53,088 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2024-09-13 09:05:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 09:05:53,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-09-13 09:05:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:05:53,090 INFO L225 Difference]: With dead ends: 83 [2024-09-13 09:05:53,090 INFO L226 Difference]: Without dead ends: 81 [2024-09-13 09:05:53,091 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-09-13 09:05:53,091 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:05:53,092 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 121 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:05:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-13 09:05:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-09-13 09:05:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 51 states have internal predecessors, (60), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-13 09:05:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-09-13 09:05:53,110 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 40 [2024-09-13 09:05:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:05:53,110 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-09-13 09:05:53,111 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 09:05:53,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-09-13 09:05:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-13 09:05:53,112 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:05:53,112 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:05:53,112 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 09:05:53,112 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:05:53,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:53,113 INFO L85 PathProgramCache]: Analyzing trace with hash -930915559, now seen corresponding path program 1 times [2024-09-13 09:05:53,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:05:53,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854362177] [2024-09-13 09:05:53,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:53,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:05:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:53,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:05:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:53,274 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:05:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:53,277 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 09:05:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:53,280 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-13 09:05:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:53,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-13 09:05:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:53,310 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 09:05:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:53,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-13 09:05:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-13 09:05:53,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:05:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854362177] [2024-09-13 09:05:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854362177] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 09:05:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334415275] [2024-09-13 09:05:53,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:53,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:05:53,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:05:53,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 09:05:53,336 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 09:05:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:53,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 09:05:53,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:05:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-13 09:05:53,494 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 09:05:53,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334415275] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 09:05:53,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 09:05:53,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-09-13 09:05:53,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732429431] [2024-09-13 09:05:53,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:05:53,495 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 09:05:53,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:05:53,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 09:05:53,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-09-13 09:05:53,496 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-13 09:05:53,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:05:53,597 INFO L93 Difference]: Finished difference Result 94 states and 120 transitions. [2024-09-13 09:05:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 09:05:53,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2024-09-13 09:05:53,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:05:53,599 INFO L225 Difference]: With dead ends: 94 [2024-09-13 09:05:53,599 INFO L226 Difference]: Without dead ends: 92 [2024-09-13 09:05:53,600 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-09-13 09:05:53,600 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:05:53,601 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 185 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:05:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-13 09:05:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2024-09-13 09:05:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 56 states have internal predecessors, (63), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-13 09:05:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2024-09-13 09:05:53,617 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 46 [2024-09-13 09:05:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:05:53,618 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2024-09-13 09:05:53,618 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-13 09:05:53,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2024-09-13 09:05:53,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-13 09:05:53,619 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:05:53,620 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:05:53,637 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 09:05:53,823 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:05:53,824 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:05:53,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash -872582608, now seen corresponding path program 1 times [2024-09-13 09:05:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:05:53,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968701118] [2024-09-13 09:05:53,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:53,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:05:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 09:05:53,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754345652] [2024-09-13 09:05:53,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:53,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:05:53,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:05:53,841 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 09:05:53,842 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 09:05:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:53,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-13 09:05:53,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:05:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-13 09:05:54,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:05:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-13 09:05:54,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:05:54,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968701118] [2024-09-13 09:05:54,496 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 09:05:54,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754345652] [2024-09-13 09:05:54,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754345652] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 09:05:54,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 09:05:54,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-09-13 09:05:54,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543238513] [2024-09-13 09:05:54,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 09:05:54,498 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 09:05:54,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:05:54,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 09:05:54,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-09-13 09:05:54,500 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-13 09:05:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:05:54,660 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2024-09-13 09:05:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 09:05:54,661 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 49 [2024-09-13 09:05:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:05:54,662 INFO L225 Difference]: With dead ends: 93 [2024-09-13 09:05:54,662 INFO L226 Difference]: Without dead ends: 90 [2024-09-13 09:05:54,663 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-09-13 09:05:54,663 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 34 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:05:54,664 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 113 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:05:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-13 09:05:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-09-13 09:05:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 58 states have internal predecessors, (63), 24 states have call successors, (24), 11 states have call predecessors, (24), 10 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-13 09:05:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2024-09-13 09:05:54,690 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 49 [2024-09-13 09:05:54,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:05:54,690 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2024-09-13 09:05:54,690 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-13 09:05:54,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:54,691 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2024-09-13 09:05:54,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-13 09:05:54,692 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 09:05:54,692 INFO L216 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:05:54,710 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-13 09:05:54,896 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:05:54,897 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 09:05:54,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1070557628, now seen corresponding path program 1 times [2024-09-13 09:05:54,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 09:05:54,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618129341] [2024-09-13 09:05:54,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 09:05:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:55,022 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 09:05:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:55,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 09:05:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:55,036 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-13 09:05:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:55,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-13 09:05:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:55,048 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-13 09:05:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:55,051 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 09:05:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:55,054 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-13 09:05:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:55,057 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-13 09:05:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:55,060 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 09:05:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:55,062 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-13 09:05:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:55,065 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-13 09:05:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-09-13 09:05:55,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 09:05:55,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618129341] [2024-09-13 09:05:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618129341] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 09:05:55,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093290959] [2024-09-13 09:05:55,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 09:05:55,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 09:05:55,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 09:05:55,070 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 09:05:55,071 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-13 09:05:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 09:05:55,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 09:05:55,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 09:05:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-13 09:05:55,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 09:05:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-09-13 09:05:55,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093290959] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 09:05:55,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 09:05:55,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 9 [2024-09-13 09:05:55,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276259913] [2024-09-13 09:05:55,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 09:05:55,284 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 09:05:55,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 09:05:55,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 09:05:55,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-13 09:05:55,285 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 5 states have call predecessors, (23), 6 states have call successors, (23) [2024-09-13 09:05:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 09:05:55,438 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2024-09-13 09:05:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-13 09:05:55,439 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 5 states have call predecessors, (23), 6 states have call successors, (23) Word has length 70 [2024-09-13 09:05:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 09:05:55,439 INFO L225 Difference]: With dead ends: 125 [2024-09-13 09:05:55,440 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 09:05:55,441 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-09-13 09:05:55,441 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 09:05:55,441 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 73 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 09:05:55,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 09:05:55,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 09:05:55,442 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-13 09:05:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 09:05:55,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2024-09-13 09:05:55,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 09:05:55,443 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 09:05:55,443 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (23), 5 states have call predecessors, (23), 6 states have call successors, (23) [2024-09-13 09:05:55,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 09:05:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 09:05:55,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 09:05:55,446 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-13 09:05:55,463 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-13 09:05:55,647 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-13 09:05:55,651 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 09:05:55,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-13 09:05:56,728 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 09:05:56,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 09:05:56 BoogieIcfgContainer [2024-09-13 09:05:56,746 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 09:05:56,746 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-13 09:05:56,746 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-13 09:05:56,747 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-13 09:05:56,747 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 09:05:49" (3/4) ... [2024-09-13 09:05:56,749 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-13 09:05:56,752 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-13 09:05:56,752 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-13 09:05:56,752 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-13 09:05:56,752 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-13 09:05:56,756 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-09-13 09:05:56,756 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-13 09:05:56,756 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-13 09:05:56,756 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-13 09:05:56,782 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(counter) == 0) && (((((2 <= counter) && ((((__int128) q * y) + r) == x)) && (((((__int128) q * y) + r) + ((__int128) a * y)) == (b + x))) && (1 <= y)) || ((((((a == 0) && (x == r)) && (b == 0)) && (counter == 0)) && (q == 0)) && (1 <= y)))) [2024-09-13 09:05:56,782 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 <= counter) && (a == 1)) && (((((__int128) q * y) + y) + r) == (b + x))) && (1 <= r)) && (b == y)) && (1 <= y)) || ((((((2 <= counter) && (x == r)) && (1 <= r)) && ((r + ((__int128) a * y)) == (b + x))) && (q == 0)) && (1 <= y))) || (((((((a == 1) && ((y + r) == (b + x))) && (1 <= r)) && (b == y)) && (q == 0)) && (counter == 1)) && (1 <= y))) && (\old(counter) == 0)) [2024-09-13 09:05:56,856 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-13 09:05:56,857 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-13 09:05:56,857 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-13 09:05:56,857 INFO L158 Benchmark]: Toolchain (without parser) took 7552.10ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 108.9MB in the beginning and 110.0MB in the end (delta: -1.1MB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2024-09-13 09:05:56,857 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory was 96.3MB in the beginning and 96.1MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 09:05:56,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.09ms. Allocated memory is still 159.4MB. Free memory was 108.5MB in the beginning and 97.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-13 09:05:56,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.07ms. Allocated memory is still 159.4MB. Free memory was 96.8MB in the beginning and 95.9MB in the end (delta: 877.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 09:05:56,858 INFO L158 Benchmark]: Boogie Preprocessor took 65.01ms. Allocated memory is still 159.4MB. Free memory was 95.9MB in the beginning and 94.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 09:05:56,858 INFO L158 Benchmark]: RCFGBuilder took 360.59ms. Allocated memory is still 159.4MB. Free memory was 94.3MB in the beginning and 80.8MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 09:05:56,859 INFO L158 Benchmark]: TraceAbstraction took 6755.40ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 80.0MB in the beginning and 115.2MB in the end (delta: -35.2MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2024-09-13 09:05:56,859 INFO L158 Benchmark]: Witness Printer took 110.41ms. Allocated memory is still 203.4MB. Free memory was 115.2MB in the beginning and 110.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-13 09:05:56,860 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory was 96.3MB in the beginning and 96.1MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.09ms. Allocated memory is still 159.4MB. Free memory was 108.5MB in the beginning and 97.1MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.07ms. Allocated memory is still 159.4MB. Free memory was 96.8MB in the beginning and 95.9MB in the end (delta: 877.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.01ms. Allocated memory is still 159.4MB. Free memory was 95.9MB in the beginning and 94.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 360.59ms. Allocated memory is still 159.4MB. Free memory was 94.3MB in the beginning and 80.8MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6755.40ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 80.0MB in the beginning and 115.2MB in the end (delta: -35.2MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. * Witness Printer took 110.41ms. Allocated memory is still 203.4MB. Free memory was 115.2MB in the beginning and 110.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 10, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 1089 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 774 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 726 IncrementalHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 315 mSDtfsCounter, 726 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 471 GetRequests, 390 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=9, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 561 ConstructedInterpolants, 0 QuantifiedInterpolants, 1466 SizeOfPredicates, 11 NumberOfNonLiveVariables, 674 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 751/763 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((((2 <= counter) && (a == 1)) && (((((__int128) q * y) + y) + r) == (b + x))) && (1 <= r)) && (b == y)) && (1 <= y)) || ((((((2 <= counter) && (x == r)) && (1 <= r)) && ((r + ((__int128) a * y)) == (b + x))) && (q == 0)) && (1 <= y))) || (((((((a == 1) && ((y + r) == (b + x))) && (1 <= r)) && (b == y)) && (q == 0)) && (counter == 1)) && (1 <= y))) && (\old(counter) == 0)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((\old(counter) == 0) && (((((2 <= counter) && ((((__int128) q * y) + r) == x)) && (((((__int128) q * y) + r) + ((__int128) a * y)) == (b + x))) && (1 <= y)) || ((((((a == 0) && (x == r)) && (b == 0)) && (counter == 0)) && (q == 0)) && (1 <= y)))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((\old(cond) != 0) && (counter == 0)) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-13 09:05:56,879 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE