./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound100.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 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/hard-ll_valuebound100.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 e3523bc8254ad35e64aad06fd6e3c84672a9aa19521e18482795d6584edb45d0 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:52:52,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:52:52,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:52:52,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:52:52,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:52:52,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:52:52,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:52:52,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:52:52,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:52:52,549 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:52:52,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:52:52,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:52:52,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:52:52,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:52:52,550 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:52:52,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:52:52,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:52:52,551 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:52:52,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:52:52,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:52:52,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:52:52,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:52:52,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:52:52,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:52:52,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:52:52,557 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:52:52,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:52:52,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:52:52,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:52:52,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:52:52,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:52:52,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:52:52,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:52:52,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:52:52,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:52:52,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:52:52,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:52:52,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:52:52,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:52:52,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:52:52,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:52:52,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:52:52,564 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 -> e3523bc8254ad35e64aad06fd6e3c84672a9aa19521e18482795d6584edb45d0 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:52:52,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:52:52,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:52:52,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:52:52,857 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:52:52,858 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:52:52,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound100.c [2024-10-15 14:52:54,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:52:54,474 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:52:54,475 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound100.c [2024-10-15 14:52:54,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e4d42e035/63074a650aec4c2c9c805ea1d3bed23e/FLAG7a968037e [2024-10-15 14:52:54,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e4d42e035/63074a650aec4c2c9c805ea1d3bed23e [2024-10-15 14:52:54,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:52:54,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:52:54,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:52:54,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:52:54,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:52:54,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:52:54" (1/1) ... [2024-10-15 14:52:54,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3608222c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54, skipping insertion in model container [2024-10-15 14:52:54,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:52:54" (1/1) ... [2024-10-15 14:52:54,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:52:54,718 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound100.c[538,551] [2024-10-15 14:52:54,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:52:54,746 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:52:54,759 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound100.c[538,551] [2024-10-15 14:52:54,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:52:54,788 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:52:54,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54 WrapperNode [2024-10-15 14:52:54,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:52:54,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:52:54,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:52:54,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:52:54,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54" (1/1) ... [2024-10-15 14:52:54,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54" (1/1) ... [2024-10-15 14:52:54,808 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:52:54,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:52:54,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:52:54,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:52:54,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:52:54,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54" (1/1) ... [2024-10-15 14:52:54,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54" (1/1) ... [2024-10-15 14:52:54,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54" (1/1) ... [2024-10-15 14:52:54,835 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-10-15 14:52:54,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54" (1/1) ... [2024-10-15 14:52:54,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54" (1/1) ... [2024-10-15 14:52:54,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54" (1/1) ... [2024-10-15 14:52:54,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54" (1/1) ... [2024-10-15 14:52:54,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54" (1/1) ... [2024-10-15 14:52:54,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54" (1/1) ... [2024-10-15 14:52:54,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:52:54,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:52:54,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:52:54,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:52:54,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54" (1/1) ... [2024-10-15 14:52:54,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:52:54,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:52:54,879 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-10-15 14:52:54,882 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-10-15 14:52:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:52:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 14:52:54,926 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 14:52:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:52:54,927 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:52:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:52:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:52:54,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:52:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:52:54,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:52:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:52:54,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:52:54,982 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:52:54,984 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:52:55,154 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-15 14:52:55,155 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:52:55,180 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:52:55,180 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:52:55,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:52:55 BoogieIcfgContainer [2024-10-15 14:52:55,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:52:55,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:52:55,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:52:55,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:52:55,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:52:54" (1/3) ... [2024-10-15 14:52:55,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d2822a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:52:55, skipping insertion in model container [2024-10-15 14:52:55,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:52:54" (2/3) ... [2024-10-15 14:52:55,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d2822a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:52:55, skipping insertion in model container [2024-10-15 14:52:55,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:52:55" (3/3) ... [2024-10-15 14:52:55,191 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound100.c [2024-10-15 14:52:55,204 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:52:55,204 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:52:55,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:52:55,260 INFO L333 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;@44f79639, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:52:55,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:52:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-15 14:52:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-15 14:52:55,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:55,272 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:52:55,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:55,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:55,278 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-10-15 14:52:55,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:55,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543143210] [2024-10-15 14:52:55,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:55,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:52:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:52:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:52:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:52:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:52:55,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:55,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543143210] [2024-10-15 14:52:55,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543143210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:52:55,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:52:55,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:52:55,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923129678] [2024-10-15 14:52:55,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:55,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:52:55,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:55,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:52:55,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:52:55,493 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:52:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:55,538 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-10-15 14:52:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:52:55,541 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-10-15 14:52:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:55,546 INFO L225 Difference]: With dead ends: 66 [2024-10-15 14:52:55,547 INFO L226 Difference]: Without dead ends: 32 [2024-10-15 14:52:55,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:52:55,552 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:52:55,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:52:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-15 14:52:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-15 14:52:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-15 14:52:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-10-15 14:52:55,587 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-10-15 14:52:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:55,587 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-10-15 14:52:55,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:52:55,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-10-15 14:52:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-15 14:52:55,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:55,590 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:52:55,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:52:55,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:55,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-10-15 14:52:55,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:55,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448200026] [2024-10-15 14:52:55,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:55,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:52:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:52:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:52:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:52:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:55,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:52:55,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:55,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448200026] [2024-10-15 14:52:55,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448200026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:52:55,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:52:55,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:52:55,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55797644] [2024-10-15 14:52:55,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:55,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:52:55,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:55,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:52:55,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:52:55,846 INFO L87 Difference]: Start difference. First operand 32 states and 42 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, (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-10-15 14:52:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:55,917 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-10-15 14:52:55,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:52:55,918 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, (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 27 [2024-10-15 14:52:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:55,920 INFO L225 Difference]: With dead ends: 45 [2024-10-15 14:52:55,920 INFO L226 Difference]: Without dead ends: 43 [2024-10-15 14:52:55,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:52:55,922 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:52:55,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:52:55,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-15 14:52:55,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-10-15 14:52:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-15 14:52:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-10-15 14:52:55,934 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-10-15 14:52:55,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:55,934 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-15 14:52:55,935 INFO L472 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, (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-10-15 14:52:55,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-10-15 14:52:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-15 14:52:55,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:55,936 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:52:55,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:52:55,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:55,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:55,937 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-10-15 14:52:55,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:55,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121233073] [2024-10-15 14:52:55,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:55,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:56,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:52:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:56,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:52:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:56,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:52:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:56,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:52:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:56,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:52:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:52:56,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:56,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121233073] [2024-10-15 14:52:56,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121233073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:52:56,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:52:56,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:52:56,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225009670] [2024-10-15 14:52:56,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:56,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:52:56,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:56,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:52:56,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:52:56,163 INFO L87 Difference]: Start difference. First operand 36 states and 45 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:52:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:56,221 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-10-15 14:52:56,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:52:56,222 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-10-15 14:52:56,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:56,224 INFO L225 Difference]: With dead ends: 49 [2024-10-15 14:52:56,224 INFO L226 Difference]: Without dead ends: 47 [2024-10-15 14:52:56,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-10-15 14:52:56,225 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:52:56,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:52:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-15 14:52:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-10-15 14:52:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-15 14:52:56,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-10-15 14:52:56,236 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-10-15 14:52:56,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:56,237 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-10-15 14:52:56,237 INFO L472 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:52:56,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-10-15 14:52:56,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-15 14:52:56,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:56,238 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:52:56,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:52:56,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:56,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:56,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-10-15 14:52:56,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:56,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593546722] [2024-10-15 14:52:56,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:56,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:52:56,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508097018] [2024-10-15 14:52:56,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:56,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:56,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:52:56,270 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-10-15 14:52:56,272 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:52:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:56,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 14:52:56,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:52:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-15 14:52:56,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:52:56,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:56,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593546722] [2024-10-15 14:52:56,454 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:52:56,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508097018] [2024-10-15 14:52:56,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508097018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:52:56,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:52:56,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:52:56,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199163501] [2024-10-15 14:52:56,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:56,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:52:56,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:56,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:52:56,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:52:56,456 INFO L87 Difference]: Start difference. First operand 40 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-15 14:52:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:56,549 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-10-15 14:52:56,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:52:56,550 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-10-15 14:52:56,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:56,552 INFO L225 Difference]: With dead ends: 66 [2024-10-15 14:52:56,553 INFO L226 Difference]: Without dead ends: 53 [2024-10-15 14:52:56,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-10-15 14:52:56,555 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:52:56,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:52:56,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-15 14:52:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-15 14:52:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-15 14:52:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-10-15 14:52:56,566 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-10-15 14:52:56,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:56,567 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-10-15 14:52:56,567 INFO L472 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-15 14:52:56,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-10-15 14:52:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-15 14:52:56,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:56,569 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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-10-15 14:52:56,589 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 14:52:56,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:56,774 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:56,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:56,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-10-15 14:52:56,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:56,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114358461] [2024-10-15 14:52:56,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:56,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:52:56,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305665361] [2024-10-15 14:52:56,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:56,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:56,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:52:56,806 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-10-15 14:52:56,808 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:52:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:56,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-15 14:52:56,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:52:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-15 14:52:56,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:52:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-15 14:52:57,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:57,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114358461] [2024-10-15 14:52:57,165 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:52:57,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305665361] [2024-10-15 14:52:57,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305665361] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:52:57,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:52:57,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-10-15 14:52:57,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664352068] [2024-10-15 14:52:57,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:52:57,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-15 14:52:57,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:57,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 14:52:57,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:52:57,168 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-15 14:52:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:57,316 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-10-15 14:52:57,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:52:57,317 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 44 [2024-10-15 14:52:57,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:57,323 INFO L225 Difference]: With dead ends: 68 [2024-10-15 14:52:57,323 INFO L226 Difference]: Without dead ends: 66 [2024-10-15 14:52:57,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-15 14:52:57,324 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:52:57,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:52:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-15 14:52:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-10-15 14:52:57,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-15 14:52:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-10-15 14:52:57,347 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 44 [2024-10-15 14:52:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:57,350 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-10-15 14:52:57,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-15 14:52:57,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-10-15 14:52:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-15 14:52:57,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:57,352 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:52:57,369 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 14:52:57,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:57,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:57,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:57,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-10-15 14:52:57,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:57,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282371137] [2024-10-15 14:52:57,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:57,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:52:57,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1513185715] [2024-10-15 14:52:57,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:57,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:57,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:52:57,575 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-10-15 14:52:57,576 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:52:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:57,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 14:52:57,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:52:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-15 14:52:57,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:52:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-15 14:52:57,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:57,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282371137] [2024-10-15 14:52:57,834 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:52:57,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513185715] [2024-10-15 14:52:57,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513185715] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-15 14:52:57,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:52:57,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-15 14:52:57,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157717201] [2024-10-15 14:52:57,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:57,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:52:57,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:57,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:52:57,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:52:57,836 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 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-10-15 14:52:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:57,902 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2024-10-15 14:52:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:52:57,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 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 54 [2024-10-15 14:52:57,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:57,904 INFO L225 Difference]: With dead ends: 73 [2024-10-15 14:52:57,904 INFO L226 Difference]: Without dead ends: 71 [2024-10-15 14:52:57,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:52:57,905 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:52:57,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 125 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:52:57,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-15 14:52:57,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-10-15 14:52:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 42 states have internal predecessors, (46), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-15 14:52:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2024-10-15 14:52:57,922 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 54 [2024-10-15 14:52:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:57,922 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2024-10-15 14:52:57,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 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-10-15 14:52:57,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2024-10-15 14:52:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-15 14:52:57,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:57,924 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:52:57,942 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 14:52:58,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-15 14:52:58,129 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:58,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash 515743006, now seen corresponding path program 1 times [2024-10-15 14:52:58,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:58,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509966797] [2024-10-15 14:52:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:52:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:52:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:52:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:52:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:52:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:52:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:52:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:52:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:52:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-15 14:52:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-15 14:52:58,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:52:58,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509966797] [2024-10-15 14:52:58,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509966797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:52:58,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:52:58,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:52:58,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374662962] [2024-10-15 14:52:58,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:52:58,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:52:58,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:52:58,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:52:58,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:52:58,279 INFO L87 Difference]: Start difference. First operand 70 states and 88 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-15 14:52:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:52:58,338 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2024-10-15 14:52:58,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:52:58,338 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2024-10-15 14:52:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:52:58,340 INFO L225 Difference]: With dead ends: 78 [2024-10-15 14:52:58,340 INFO L226 Difference]: Without dead ends: 66 [2024-10-15 14:52:58,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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-10-15 14:52:58,342 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:52:58,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 142 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:52:58,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-15 14:52:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-15 14:52:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-15 14:52:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-10-15 14:52:58,368 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 60 [2024-10-15 14:52:58,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:52:58,368 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-10-15 14:52:58,368 INFO L472 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-15 14:52:58,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-10-15 14:52:58,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-15 14:52:58,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:52:58,373 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 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-10-15 14:52:58,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-15 14:52:58,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:52:58,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:52:58,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-10-15 14:52:58,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:52:58,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643872692] [2024-10-15 14:52:58,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:58,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:52:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:52:58,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [51336615] [2024-10-15 14:52:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:52:58,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:52:58,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:52:58,418 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-10-15 14:52:58,421 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:52:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:52:58,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-15 14:52:58,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:52:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-15 14:52:59,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-15 14:53:00,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:00,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643872692] [2024-10-15 14:53:00,874 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:53:00,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51336615] [2024-10-15 14:53:00,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51336615] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:00,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:53:00,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-10-15 14:53:00,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607695988] [2024-10-15 14:53:00,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:00,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-15 14:53:00,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:00,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-15 14:53:00,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-10-15 14:53:00,878 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2024-10-15 14:53:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:02,215 INFO L93 Difference]: Finished difference Result 153 states and 210 transitions. [2024-10-15 14:53:02,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-15 14:53:02,216 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 74 [2024-10-15 14:53:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:02,218 INFO L225 Difference]: With dead ends: 153 [2024-10-15 14:53:02,219 INFO L226 Difference]: Without dead ends: 130 [2024-10-15 14:53:02,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2024-10-15 14:53:02,220 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 79 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:02,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 256 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-15 14:53:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-15 14:53:02,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 105. [2024-10-15 14:53:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.180327868852459) internal successors, (72), 65 states have internal predecessors, (72), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-15 14:53:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2024-10-15 14:53:02,287 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 74 [2024-10-15 14:53:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:02,288 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2024-10-15 14:53:02,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2024-10-15 14:53:02,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2024-10-15 14:53:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-15 14:53:02,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:02,292 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 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] [2024-10-15 14:53:02,310 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-15 14:53:02,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:02,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:02,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:02,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1571705391, now seen corresponding path program 1 times [2024-10-15 14:53:02,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:02,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320911072] [2024-10-15 14:53:02,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:02,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:53:02,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1879043190] [2024-10-15 14:53:02,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:02,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:02,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:02,535 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-10-15 14:53:02,537 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 14:53:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:02,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-15 14:53:02,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-10-15 14:53:03,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-15 14:53:03,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:03,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320911072] [2024-10-15 14:53:03,734 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:53:03,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879043190] [2024-10-15 14:53:03,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879043190] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:03,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:53:03,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-10-15 14:53:03,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377742801] [2024-10-15 14:53:03,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:03,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-15 14:53:03,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:03,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-15 14:53:03,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-10-15 14:53:03,737 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2024-10-15 14:53:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:04,342 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2024-10-15 14:53:04,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 14:53:04,342 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) Word has length 85 [2024-10-15 14:53:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:04,344 INFO L225 Difference]: With dead ends: 145 [2024-10-15 14:53:04,344 INFO L226 Difference]: Without dead ends: 111 [2024-10-15 14:53:04,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2024-10-15 14:53:04,346 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 25 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:04,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 414 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-15 14:53:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-15 14:53:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2024-10-15 14:53:04,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 59 states have internal predecessors, (66), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-15 14:53:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-10-15 14:53:04,388 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 85 [2024-10-15 14:53:04,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:04,389 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-10-15 14:53:04,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2024-10-15 14:53:04,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-10-15 14:53:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-15 14:53:04,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:04,391 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 3, 3, 2, 2, 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] [2024-10-15 14:53:04,408 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-15 14:53:04,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:04,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:04,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:04,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1973508941, now seen corresponding path program 2 times [2024-10-15 14:53:04,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:04,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923081013] [2024-10-15 14:53:04,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:04,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:53:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:53:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:53:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-15 14:53:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-15 14:53:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-15 14:53:04,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:04,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923081013] [2024-10-15 14:53:04,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923081013] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:04,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999997608] [2024-10-15 14:53:04,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:53:04,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:04,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:04,820 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-10-15 14:53:04,829 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 14:53:04,884 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:53:04,884 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:53:04,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 14:53:04,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-15 14:53:04,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-15 14:53:05,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999997608] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:05,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:53:05,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-10-15 14:53:05,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044040839] [2024-10-15 14:53:05,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:05,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:53:05,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:05,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:53:05,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:53:05,008 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-15 14:53:05,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:05,079 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2024-10-15 14:53:05,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 14:53:05,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 87 [2024-10-15 14:53:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:05,083 INFO L225 Difference]: With dead ends: 124 [2024-10-15 14:53:05,083 INFO L226 Difference]: Without dead ends: 102 [2024-10-15 14:53:05,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:53:05,084 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:05,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:53:05,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-15 14:53:05,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-15 14:53:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-15 14:53:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-10-15 14:53:05,137 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 87 [2024-10-15 14:53:05,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:05,138 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-10-15 14:53:05,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-15 14:53:05,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-10-15 14:53:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-15 14:53:05,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:05,140 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 2, 2, 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, 1] [2024-10-15 14:53:05,157 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-15 14:53:05,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-15 14:53:05,341 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:05,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:05,341 INFO L85 PathProgramCache]: Analyzing trace with hash -637517709, now seen corresponding path program 1 times [2024-10-15 14:53:05,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:05,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661771472] [2024-10-15 14:53:05,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:05,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:53:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:53:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:53:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-15 14:53:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-15 14:53:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-15 14:53:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-15 14:53:05,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:05,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661771472] [2024-10-15 14:53:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661771472] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:05,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558072993] [2024-10-15 14:53:05,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:05,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:05,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:05,644 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:53:05,645 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-15 14:53:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:05,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-15 14:53:05,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-10-15 14:53:06,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-15 14:53:06,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558072993] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:06,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:53:06,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 18 [2024-10-15 14:53:06,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979541477] [2024-10-15 14:53:06,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:06,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-15 14:53:06,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:06,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-15 14:53:06,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-10-15 14:53:06,396 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) [2024-10-15 14:53:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:06,690 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2024-10-15 14:53:06,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 14:53:06,690 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) Word has length 90 [2024-10-15 14:53:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:06,692 INFO L225 Difference]: With dead ends: 117 [2024-10-15 14:53:06,692 INFO L226 Difference]: Without dead ends: 100 [2024-10-15 14:53:06,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-10-15 14:53:06,693 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 27 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:06,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 384 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:53:06,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-15 14:53:06,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-10-15 14:53:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-15 14:53:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-10-15 14:53:06,745 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 90 [2024-10-15 14:53:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:06,745 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-10-15 14:53:06,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) [2024-10-15 14:53:06,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-10-15 14:53:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-15 14:53:06,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:06,747 INFO L215 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-15 14:53:06,764 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-15 14:53:06,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:06,948 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:06,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:06,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1204328542, now seen corresponding path program 1 times [2024-10-15 14:53:06,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:06,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51407717] [2024-10-15 14:53:06,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:06,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:53:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:53:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:53:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-15 14:53:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-15 14:53:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-15 14:53:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-15 14:53:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-15 14:53:07,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:07,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51407717] [2024-10-15 14:53:07,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51407717] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:07,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524733766] [2024-10-15 14:53:07,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:07,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:07,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:07,073 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:53:07,074 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-15 14:53:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:07,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 14:53:07,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-10-15 14:53:07,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:53:07,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524733766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:53:07,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:53:07,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-10-15 14:53:07,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127033062] [2024-10-15 14:53:07,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:53:07,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:53:07,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:07,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:53:07,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:53:07,160 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-10-15 14:53:07,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:07,242 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2024-10-15 14:53:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:53:07,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 94 [2024-10-15 14:53:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:07,244 INFO L225 Difference]: With dead ends: 100 [2024-10-15 14:53:07,244 INFO L226 Difference]: Without dead ends: 88 [2024-10-15 14:53:07,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:53:07,245 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:07,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:53:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-15 14:53:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-15 14:53:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-15 14:53:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2024-10-15 14:53:07,275 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 94 [2024-10-15 14:53:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:07,276 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2024-10-15 14:53:07,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-10-15 14:53:07,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2024-10-15 14:53:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-15 14:53:07,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:07,278 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:53:07,296 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-15 14:53:07,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:07,479 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:07,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:07,479 INFO L85 PathProgramCache]: Analyzing trace with hash -588826413, now seen corresponding path program 3 times [2024-10-15 14:53:07,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:07,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379488605] [2024-10-15 14:53:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:53:07,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1184809285] [2024-10-15 14:53:07,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 14:53:07,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:07,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:07,521 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:53:07,523 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-15 14:53:08,780 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-15 14:53:08,780 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:53:08,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-15 14:53:08,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 37 proven. 49 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-15 14:53:09,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 37 proven. 49 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-15 14:53:23,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:23,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379488605] [2024-10-15 14:53:23,410 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:53:23,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184809285] [2024-10-15 14:53:23,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184809285] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:23,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:53:23,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-10-15 14:53:23,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274503633] [2024-10-15 14:53:23,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:23,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-15 14:53:23,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:23,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-15 14:53:23,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-10-15 14:53:23,414 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 12 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) [2024-10-15 14:53:28,900 WARN L286 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 174 DAG size of output: 28 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-15 14:53:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:32,230 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2024-10-15 14:53:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-15 14:53:32,231 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 12 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) Word has length 104 [2024-10-15 14:53:32,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:32,232 INFO L225 Difference]: With dead ends: 162 [2024-10-15 14:53:32,232 INFO L226 Difference]: Without dead ends: 140 [2024-10-15 14:53:32,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2024-10-15 14:53:32,234 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 52 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:32,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 433 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-15 14:53:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-15 14:53:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2024-10-15 14:53:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 75 states have (on average 1.12) internal successors, (84), 79 states have internal predecessors, (84), 38 states have call successors, (38), 15 states have call predecessors, (38), 14 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-15 14:53:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2024-10-15 14:53:32,296 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 104 [2024-10-15 14:53:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:32,297 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2024-10-15 14:53:32,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 12 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 10 states have call predecessors, (30), 10 states have call successors, (30) [2024-10-15 14:53:32,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2024-10-15 14:53:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-15 14:53:32,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:32,298 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:53:32,307 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-15 14:53:32,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-15 14:53:32,499 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:32,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:32,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1973122394, now seen corresponding path program 2 times [2024-10-15 14:53:32,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:32,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013078248] [2024-10-15 14:53:32,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:32,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:53:32,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571819913] [2024-10-15 14:53:32,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:53:32,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:32,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:32,561 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:53:32,562 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-15 14:53:32,628 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:53:32,629 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:53:32,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-15 14:53:32,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 124 proven. 22 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-10-15 14:53:32,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-15 14:53:32,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:32,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013078248] [2024-10-15 14:53:32,986 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:53:32,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571819913] [2024-10-15 14:53:32,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571819913] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:32,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:53:32,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2024-10-15 14:53:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390124771] [2024-10-15 14:53:32,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:32,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-15 14:53:32,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:32,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-15 14:53:32,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-15 14:53:32,988 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-15 14:53:33,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:33,553 INFO L93 Difference]: Finished difference Result 142 states and 169 transitions. [2024-10-15 14:53:33,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 14:53:33,554 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) Word has length 115 [2024-10-15 14:53:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:33,555 INFO L225 Difference]: With dead ends: 142 [2024-10-15 14:53:33,555 INFO L226 Difference]: Without dead ends: 140 [2024-10-15 14:53:33,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-10-15 14:53:33,556 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:33,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 216 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:53:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-15 14:53:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-10-15 14:53:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 84 states have (on average 1.1071428571428572) internal successors, (93), 88 states have internal predecessors, (93), 38 states have call successors, (38), 18 states have call predecessors, (38), 17 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-15 14:53:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2024-10-15 14:53:33,609 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 115 [2024-10-15 14:53:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:33,610 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2024-10-15 14:53:33,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-15 14:53:33,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2024-10-15 14:53:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-15 14:53:33,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:33,612 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:53:33,628 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-15 14:53:33,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-15 14:53:33,813 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:33,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1536141598, now seen corresponding path program 4 times [2024-10-15 14:53:33,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:33,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097638785] [2024-10-15 14:53:33,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:33,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:53:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:53:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:53:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-15 14:53:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-15 14:53:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-15 14:53:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-15 14:53:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-15 14:53:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-15 14:53:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-15 14:53:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-10-15 14:53:34,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:34,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097638785] [2024-10-15 14:53:34,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097638785] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:34,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99221641] [2024-10-15 14:53:34,121 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 14:53:34,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:34,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:34,123 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:53:34,125 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-15 14:53:34,189 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 14:53:34,189 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:53:34,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 14:53:34,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:34,235 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-10-15 14:53:34,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-10-15 14:53:34,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99221641] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:34,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:53:34,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-15 14:53:34,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181253258] [2024-10-15 14:53:34,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:34,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:53:34,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:34,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:53:34,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:53:34,374 INFO L87 Difference]: Start difference. First operand 140 states and 167 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2024-10-15 14:53:34,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:34,506 INFO L93 Difference]: Finished difference Result 167 states and 200 transitions. [2024-10-15 14:53:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:53:34,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) Word has length 117 [2024-10-15 14:53:34,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:34,508 INFO L225 Difference]: With dead ends: 167 [2024-10-15 14:53:34,508 INFO L226 Difference]: Without dead ends: 144 [2024-10-15 14:53:34,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:53:34,511 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:34,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 273 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:53:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-15 14:53:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2024-10-15 14:53:34,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 90 states have internal predecessors, (94), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-15 14:53:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2024-10-15 14:53:34,580 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 170 transitions. Word has length 117 [2024-10-15 14:53:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:34,581 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 170 transitions. [2024-10-15 14:53:34,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2024-10-15 14:53:34,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2024-10-15 14:53:34,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-15 14:53:34,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:34,583 INFO L215 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:53:34,598 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-15 14:53:34,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-15 14:53:34,783 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:34,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:34,784 INFO L85 PathProgramCache]: Analyzing trace with hash 47128766, now seen corresponding path program 2 times [2024-10-15 14:53:34,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:34,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071403794] [2024-10-15 14:53:34,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:34,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:53:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:53:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 14:53:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 14:53:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:53:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:53:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:53:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-15 14:53:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-15 14:53:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-15 14:53:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 14:53:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:53:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-15 14:53:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-15 14:53:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-15 14:53:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-15 14:53:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-15 14:53:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-15 14:53:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-15 14:53:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-15 14:53:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:53:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-10-15 14:53:35,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:53:35,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071403794] [2024-10-15 14:53:35,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071403794] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:53:35,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176628273] [2024-10-15 14:53:35,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:53:35,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:35,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:35,281 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:53:35,282 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-15 14:53:35,347 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:53:35,348 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:53:35,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-15 14:53:35,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-10-15 14:53:35,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:53:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-10-15 14:53:36,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176628273] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:53:36,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:53:36,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 14] total 30 [2024-10-15 14:53:36,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651670535] [2024-10-15 14:53:36,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:53:36,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-15 14:53:36,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:53:36,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-15 14:53:36,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2024-10-15 14:53:36,827 INFO L87 Difference]: Start difference. First operand 142 states and 170 transitions. Second operand has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 27 states have internal predecessors, (62), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 19 states have call predecessors, (49), 19 states have call successors, (49) [2024-10-15 14:53:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:53:37,440 INFO L93 Difference]: Finished difference Result 158 states and 191 transitions. [2024-10-15 14:53:37,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 14:53:37,441 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 27 states have internal predecessors, (62), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 19 states have call predecessors, (49), 19 states have call successors, (49) Word has length 120 [2024-10-15 14:53:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:53:37,442 INFO L225 Difference]: With dead ends: 158 [2024-10-15 14:53:37,442 INFO L226 Difference]: Without dead ends: 130 [2024-10-15 14:53:37,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2024-10-15 14:53:37,443 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:53:37,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 530 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:53:37,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-15 14:53:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2024-10-15 14:53:37,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 80 states have internal predecessors, (83), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-15 14:53:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2024-10-15 14:53:37,476 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 120 [2024-10-15 14:53:37,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:53:37,476 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2024-10-15 14:53:37,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 27 states have internal predecessors, (62), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 19 states have call predecessors, (49), 19 states have call successors, (49) [2024-10-15 14:53:37,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2024-10-15 14:53:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-15 14:53:37,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:53:37,478 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:53:37,492 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-15 14:53:37,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-15 14:53:37,683 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:53:37,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:53:37,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1414642200, now seen corresponding path program 5 times [2024-10-15 14:53:37,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:53:37,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284641709] [2024-10-15 14:53:37,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:53:37,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:53:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:53:37,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121631692] [2024-10-15 14:53:37,753 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-15 14:53:37,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:53:37,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:53:37,757 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:53:37,758 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-15 14:53:37,859 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-10-15 14:53:37,859 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:53:37,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-15 14:53:37,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:53:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 82 proven. 101 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-10-15 14:53:38,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:54:38,949 WARN L286 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-15 14:55:43,523 WARN L286 SmtUtils]: Spent 14.67s on a formula simplification that was a NOOP. DAG size: 244 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-15 14:56:39,125 WARN L286 SmtUtils]: Spent 14.95s on a formula simplification. DAG size of input: 240 DAG size of output: 240 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-15 14:56:58,405 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 113 proven. 132 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-10-15 14:56:58,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:56:58,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284641709] [2024-10-15 14:56:58,406 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:56:58,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121631692] [2024-10-15 14:56:58,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121631692] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:56:58,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:56:58,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2024-10-15 14:56:58,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418742683] [2024-10-15 14:56:58,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:56:58,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-15 14:56:58,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:56:58,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-15 14:56:58,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=857, Unknown=0, NotChecked=0, Total=1056 [2024-10-15 14:56:58,408 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 29 states have internal predecessors, (60), 20 states have call successors, (43), 4 states have call predecessors, (43), 3 states have return successors, (40), 15 states have call predecessors, (40), 18 states have call successors, (40) [2024-10-15 14:56:58,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:56:58,945 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2024-10-15 14:56:58,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:56:58,945 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 29 states have internal predecessors, (60), 20 states have call successors, (43), 4 states have call predecessors, (43), 3 states have return successors, (40), 15 states have call predecessors, (40), 18 states have call successors, (40) Word has length 134 [2024-10-15 14:56:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:56:58,946 INFO L225 Difference]: With dead ends: 126 [2024-10-15 14:56:58,946 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:56:58,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 53.2s TimeCoverageRelationStatistics Valid=199, Invalid=857, Unknown=0, NotChecked=0, Total=1056 [2024-10-15 14:56:58,947 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-15 14:56:58,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 14:56:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:56:58,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:56:58,947 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-10-15 14:56:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:56:58,947 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2024-10-15 14:56:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:56:58,948 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:56:58,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 29 states have internal predecessors, (60), 20 states have call successors, (43), 4 states have call predecessors, (43), 3 states have return successors, (40), 15 states have call predecessors, (40), 18 states have call successors, (40) [2024-10-15 14:56:58,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:56:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:56:58,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:56:58,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 14:56:58,963 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-15 14:56:59,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-15 14:56:59,153 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:56:59,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:57:01,296 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:57:01,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:57:01 BoogieIcfgContainer [2024-10-15 14:57:01,328 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:57:01,328 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:57:01,328 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:57:01,329 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:57:01,329 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:52:55" (3/4) ... [2024-10-15 14:57:01,331 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:57:01,388 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:57:01,389 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:57:01,389 INFO L158 Benchmark]: Toolchain (without parser) took 246889.67ms. Allocated memory was 123.7MB in the beginning and 408.9MB in the end (delta: 285.2MB). Free memory was 53.8MB in the beginning and 135.7MB in the end (delta: -81.9MB). Peak memory consumption was 204.0MB. Max. memory is 16.1GB. [2024-10-15 14:57:01,389 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 123.7MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:57:01,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.65ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 53.6MB in the beginning and 128.0MB in the end (delta: -74.3MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-10-15 14:57:01,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.09ms. Allocated memory is still 161.5MB. Free memory was 128.0MB in the beginning and 126.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:57:01,390 INFO L158 Benchmark]: Boogie Preprocessor took 39.63ms. Allocated memory is still 161.5MB. Free memory was 126.9MB in the beginning and 124.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:57:01,391 INFO L158 Benchmark]: RCFGBuilder took 331.14ms. Allocated memory is still 161.5MB. Free memory was 124.8MB in the beginning and 110.1MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-15 14:57:01,391 INFO L158 Benchmark]: TraceAbstraction took 246144.74ms. Allocated memory was 161.5MB in the beginning and 408.9MB in the end (delta: 247.5MB). Free memory was 110.1MB in the beginning and 137.8MB in the end (delta: -27.6MB). Peak memory consumption was 228.2MB. Max. memory is 16.1GB. [2024-10-15 14:57:01,391 INFO L158 Benchmark]: Witness Printer took 60.20ms. Allocated memory is still 408.9MB. Free memory was 137.8MB in the beginning and 135.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:57:01,392 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 123.7MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.65ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 53.6MB in the beginning and 128.0MB in the end (delta: -74.3MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.09ms. Allocated memory is still 161.5MB. Free memory was 128.0MB in the beginning and 126.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.63ms. Allocated memory is still 161.5MB. Free memory was 126.9MB in the beginning and 124.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.14ms. Allocated memory is still 161.5MB. Free memory was 124.8MB in the beginning and 110.1MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 246144.74ms. Allocated memory was 161.5MB in the beginning and 408.9MB in the end (delta: 247.5MB). Free memory was 110.1MB in the beginning and 137.8MB in the end (delta: -27.6MB). Peak memory consumption was 228.2MB. Max. memory is 16.1GB. * Witness Printer took 60.20ms. Allocated memory is still 408.9MB. Free memory was 137.8MB in the beginning and 135.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 243.9s, OverallIterations: 17, TraceHistogramMax: 19, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 285 mSDsluCounter, 3837 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3174 mSDsCounter, 354 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2430 IncrementalHoareTripleChecker+Invalid, 2784 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 354 mSolverCounterUnsat, 663 mSDtfsCounter, 2430 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2484 GetRequests, 2253 SyntacticMatches, 4 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 66.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=15, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 82 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 224.2s InterpolantComputationTime, 2456 NumberOfCodeBlocks, 2429 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2800 ConstructedInterpolants, 1 QuantifiedInterpolants, 57053 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2497 ConjunctsInSsa, 297 ConjunctsInUnsatCore, 33 InterpolantComputations, 7 PerfectInterpolantSequences, 8780/9467 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: ((((((((((((0 <= r) && (((__int128) r + 1) <= d)) && (((__int128) d + r) == A)) && (((__int128) r + ((long long) 2 * B)) == ((__int128) A + d))) && (q == 1)) && (p == 1)) || (((((((0 <= (r + ((((__int128) -1 * d) >= 0) ? (((__int128) -1 * d) / 2) : ((((__int128) -1 * d) / 2) - 1)))) && (((__int128) r + 1) <= d)) && (((__int128) A + d) == ((__int128) ((long long) B * 4) + r))) && (((d >= 0) ? (d % 2) : ((d % 2) + 2)) == 0)) && (q == 0)) && (p == 4)) && ((A + ((d >= 0) ? (d / 2) : ((d / 2) - 1))) == ((__int128) r + ((long long) 2 * B))))) || ((((((q == 2) && (0 <= r)) && (p == 2)) && (((__int128) A + d) == ((__int128) ((long long) B * 4) + r))) && (A == ((__int128) r + ((long long) 2 * B)))) && ((((__int128) d + r) + 1) <= ((long long) B * 4)))) || ((((((A == r) && (d == ((long long) 2 * B))) && (((__int128) r + 1) <= d)) && (p == 2)) && (q == 0)) && (B <= r))) || ((((((q == 2) && (B <= 2147483647)) && (((__int128) r + 1) <= ((__int128) d + ((d >= 0) ? (d / 2) : ((d / 2) - 1))))) && (d == (((A + ((__int128) -1 * r)) >= 0) ? ((A + ((__int128) -1 * r)) / 2) : (((A + ((__int128) -1 * r)) / 2) - 1)))) && (A == ((__int128) r + ((long long) 2 * B)))) && (p == 1))) || (((((((((__int128) r + B) + ((__int128) q * B)) == ((__int128) A + d)) && (((__int128) r + 1) <= ((__int128) d + ((d >= 0) ? (d / 2) : ((d / 2) - 1))))) && (((__int128) r + ((long long) 2 * B)) <= 4294967295)) && ((r + ((__int128) q * B)) == A)) && (((__int128) d + ((long long) 2 * B)) <= 4294967295)) && (p == 1))) || ((((d == B) && (A == r)) && (q == 0)) && (p == 1))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((d == B) && (A == r)) && (q == 0)) && (1 <= d)) && (p == 1)) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:57:01,602 WARN L435 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-15 14:57:01,662 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE